Capacity Definitions for General Channels with Receiver Side Information
نویسندگان
چکیده
We consider three capacity definitions for general channels with channel side information at the receiver, where the channel is modeled as a sequence of finite dimensional conditional distributions not necessarily stationary, ergodic, or information stable. The Shannon capacity is the highest rate asymptotically achievable with arbitrarily small error probability. The capacity versus outage is the highest rate asymptotically achievable with a given probability of decoder-recognized outage. The expected capacity is the highest average rate asymptotically achievable with a single encoder and multiple decoders, where the channel side information determines the decoder in use. As a special case of channel codes for expected rate, the code for capacity versus outage has two decoders: one operates in the non-outage states and decodes all transmitted information, and the other operates in the outage states and decodes nothing. Expected capacity equals Shannon capacity for channels governed by a stationary ergodic random process but is typically greater for general channels. These alternative capacity definitions essentially relax the constraint that all transmitted information must be decoded at the receiver. We derive capacity theorems for these capacity definitions through information density. Numerical examples are provided to demonstrate their connections and differences. We also discuss the implication of these alternative capacity definitions for end-to-end distortion, source-channel coding and separation. This work was supported by the DARPA ITMANET program under grant number 1105741-1-TFIND. The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Cambridge, Massachusetts, August 1998 and the IEEE International Symposium on Information Theory, Nice, France, June 2007. M. Effros is with the Department of Electrical Engineering, California Institute of Technology, Pasadena, CA 91125 (email: [email protected]). A. Goldsmith and Y. Liang are with the Department of Electrical Engineering, Stanford University, Stanford CA 94305 (email: [email protected]; [email protected]). April 26, 2008 DRAFT
منابع مشابه
Capacity Definitions and Coding Strategies for General Channels with Receiver Side Information - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
We consider three capacity definitions for a channel with channel side information at t h e receiver. T h e capacity is the highest rate asymptotically achievable. T h e outage capacity is t h e highest rate asymptotically achievable with a given probability of decoder-recognized outage. The expected capacity is t h e highest expected rate asymptotically achievable using a single encoder a n d ...
متن کاملComputation of the Capacity for Discrete Memoryless Channels and Sum Capacity of Multiple Access Channels with Causal Side Information at Receiver
Capacity analysis and computation for communication channels with side information at the receiver is an important area of research. Cover-Chiang have proved the increment of capacity with non-causal information at the receiver. We investigate this capacity increment for the channel with causal side information and proposed an efficient algorithm for computing the capacity of discrete memoryles...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملTwo Classes of Broadcast Channels With Side-Information: Capacity Outer Bounds
In this paper, we derive outer bounds on the capacity region of two classes of the general two-user discrete memoryless broadcast channels with side-information at the transmitter. The first class comprises the classical broadcast channel where a sender transmits two independent messages to two receivers. A constraint that each message must be kept confidential from the unintended receiver cons...
متن کاملCapacity Bounds and a Certain Capacity Region for Special Three-Receiver Broadcast Channels with Side Information
The fact that the results for 2-receiver broadcast channels (BCs) are not generalized to the 3-receiver ones is of information theoretical importance. In this paper we study two classes of discrete memoryless BCs with non-causal side information (SI), i.e. multilevel BC (MBC) and 3-receiver less noisy BC. First, we obtain an achievable rate region and a capacity outer bound for the MBC. Second,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0804.4239 شماره
صفحات -
تاریخ انتشار 2007